Competitive Algorithms for an Online Rent or Buy Problem with Variable Demand
نویسندگان
چکیده
منابع مشابه
2 Online Algorithms 2.1 Ski Rental Problem (rent-or-buy)
Online algorithms use a different model from what we’ve seen so far: the algorithm does not have the entire input at its beginning, but receives it piece by piece, sequentially, over time. After receiving each piece, the algorithm must immediately make a decision (updating a data structure, buying/selling stocks) which each have an associated cost. Ultimately, the goal of the algorithm is to mi...
متن کاملRent, Lease or Buy: Randomized Algorithms for Multislope Ski Rental
In the Multislope Ski Rental problem, the user needs a certain resource for some unknown period of time. To use the resource, the user must subscribe to one of several options, each of which consists of a one-time setup cost (“buying price”), and cost proportional to the duration of the usage (“rental rate”). The larger the price, the smaller the rent. The actual usage time is determined by an ...
متن کاملPrice Fluctuations: To Buy or to Rent
We extend the classic online ski rental problem, so that the rental price may change over time. We consider several models which differ in the knowledge given to the algorithm: whereas the price development is unknown, an algorithm may have full, partial or no knowledge about the duration of the game. We construct algorithms whose competitive ratios are up to constant or logarithmic factors opt...
متن کاملApproximation Via Cost-Sharing: A Simple Approximation Algorithm for the Multicommodity Rent-or-Buy Problem
We study the multicommodity rent-or-buy problem, a type of network design problem with economies of scale. In this problem, capacity on an edge can be rented, with cost incurred on a per-unit of capacity basis, or bought, which allows unlimited use after payment of a large fixed cost. Given a graph and a set of source-sink pairs, we seek a minimum-cost way of installing sufficient capacity on e...
متن کاملA Constant-Factor Approximation Algorithm for the Multicommodity Rent-or-Buy Problem
We present the first constant-factor approximation algorithm for network design with multiple commodities andeconomies of scale. We consider the rent-or-buy problem, a type of multicommodity buy-at-bulk network design in which there are two ways to install capacity on any givenedge. Capacity can be rented, with cost incurred on a per-unit of capacity basis, or bought, which allows u...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Undergraduate Research Online
سال: 2014
ISSN: 2327-7807
DOI: 10.1137/14s013032